Multi-level learning for classifying traffic flows from first packet data

ABSTRACT

Disclosed herein are systems and methods for multi-level classification of data traffic flows based on information in a first data packet for a data traffic flow. In exemplary embodiments of the present disclosure, a key can be generated to track data traffic flows by application names and data packet information or properties. Based on these keys, patterns can be discerned to infer data traffic information based on only the information in a first data packet. The determined patterns can be used to predict classifications of future traffic flows with similar key information. In this way, data traffic flows can be classified and steered in a network based on limited information available in a first data packet.

CROSS-REFERENCE TO RELATED APPLICATIONS

The present application is a continuation in part of, and claims the priority benefit of, U.S. patent application Ser. No. 15/425,798 filed on Feb. 6, 2017 and entitled “Multi-level Learning for Classifying Traffic Flows”. The disclosure of the above-reference application is incorporated herein in its entirety for all purposes.

TECHNICAL FIELD

This disclosure relates generally to the classification of a network traffic flow and prediction of an associated application name and/or associated application characteristics based on the classification.

BACKGROUND

The approaches described in this section could be pursued, but are not necessarily approaches that have previously been conceived or pursued. Therefore, unless otherwise indicated, it should not be assumed that any of the approaches described in this section qualify as prior art merely by virtue of their inclusion in this section.

Typically, data is sent between computing devices across a communications network in packets. The packets may be generated according to a variety of protocols such as Transmission Control Protocol (TCP), User Datagram Protocol (UDP), or the like. A network appliance in a network can be connected to many other computing devices via many different network paths. Furthermore, the network paths may traverse multiple communication networks.

When selecting a network path for a particular data traffic flow, a network appliance may first need to classify the flow to determine which network path is appropriate or optimal for the flow. The network path selection needs to be made on a first packet for a flow. However, often times a first packet for a flow is merely a packet for establishing a connection and may only have limited information, such as only header information. Thus mechanisms are needed for classifying a traffic flow based on the limited information available in a first packet for a flow.

SUMMARY

This summary is provided to introduce a selection of concepts in a simplified form that are further described in the Detailed Description below. This summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used as an aid in determining the scope of the claimed subject matter.

In various embodiments of the present disclosure, a method of selecting a network path for transmitting data across a network is disclosed. The method may comprise: receiving at a first network appliance, a first data packet of a first flow to be transmitted across a network; extracting information from a header of the first data packet; generating a key representing the extracted information from the header of the first data packet; verifying that the key is present in a data structure at the first network appliance; predicting an associated application name for the first flow based on the key; verifying that the application prediction in the data structure at the first network appliance meets a confidence threshold; selecting by the network appliance a network path based on the application prediction; and transmitting the first packet of the first flow by the first network appliance based on the selected network path.

In other embodiments, a method for inferring an application name from header information extracted from a first data packet of a first flow is disclosed. The method comprises: receiving at a first network appliance, a first data packet of a first flow to be transmitted across a network; extracting information from a header of the first data packet; building a key string from the extracted information; determining that the key is present in one or more data structures at the first network appliance, the one or more data structures comprising information regarding keys and associated application names; verifying that a prediction confidence level for an application name associated with the key that is present in the one or more data structures meets a confidence threshold; predicting an application name for the first data packet of the first flow; and determining a network path for transmission of the first flow based on the predicted application name.

Also described herein is a system for inferring an application name for a first packet of a flow at a network appliance, the system comprising: a feature extraction engine at the network appliance to extract information from the first packet of the flow received at the network appliance; an inspection engine at the network appliance to determine whether the extracted information is indicative of a known application name; and an inference engine at the network appliance to infer an application name for the first packet based on the extracted information, the inference engine further in communication with a plurality of data structures comprising key strings and associated predicted application names.

Other features, examples, and embodiments are described below.

BRIEF DESCRIPTION OF THE DRAWINGS

Embodiments are illustrated by way of example, and not by limitation in the figures of the accompanying drawings, in which like references indicate similar elements.

FIG. 1A depicts an exemplary environment within which the present disclosure may be implemented.

FIG. 1B depicts an exemplary data packet.

FIG. 2 depicts another exemplary environment within which the present disclosure may be implemented.

FIG. 3A depicts an exemplary data structure that is constructed by an appliance.

FIG. 3B depicts another exemplary data structure that is constructed by an appliance.

FIG. 4 depicts an exemplary table for tracking an exemplary string of data.

FIG. 5 depicts another exemplary table for tracking an exemplary string of data.

FIG. 6 illustrates a block diagram of an exemplary appliance.

FIG. 7 illustrates an exemplary environment for network appliances.

FIG. 8 depicts an exemplary method undertaken by the network appliance in steering traffic.

FIG. 9 depicts an exemplary system for aggregating information across multiple appliances.

FIG. 10 depicts an exemplary analysis that is conducted on packet information to classify a flow.

FIG. 11 depicts an exemplary method undertaken by a network appliance in computing a key from packet (header) data.

FIG. 12 depicts an exemplary method undertaken by a network appliance when a first packet of a flow arrives.

FIG. 13 depicts an exemplary method undertaken by a network appliance when the final application name of a flow is determined.

FIG. 14 illustrates an exemplary system within which the present disclosure can be implemented.

DETAILED DESCRIPTION

The following detailed description includes references to the accompanying drawings, which form a part of the detailed description. The drawings show illustrations, in accordance with exemplary embodiments. These exemplary embodiments, which are also referred to herein as “examples,” are described in enough detail to enable those skilled in the art to practice the present subject matter. The embodiments can be combined, other embodiments can be utilized, or structural, logical, and electrical changes can be made without departing from the scope of what is claimed. The following detailed description is therefore not to be taken in a limiting sense, and the scope is defined by the appended claims and their equivalents. In this document, the terms “a” and “an” are used, as is common in patent documents, to include one or more than one. In this document, the term “or” is used to refer to a nonexclusive “or,” such that “A or B” includes “A but not B,” “B but not A,” and “A and B,” unless otherwise indicated.

The embodiments disclosed herein may be implemented using a variety of technologies. For example, the methods described herein may be implemented in software executing on a computer system containing one or more computers, or in hardware utilizing either a combination of microprocessors or other specially designed application-specific integrated circuits (ASICs), programmable logic devices, or various combinations thereof. In particular, the methods described herein may be implemented by a series of computer-executable instructions residing on a storage medium, such as a disk drive, or computer-readable medium.

The embodiments described herein relate to mechanisms for classifying flows via a first packet of the flow.

I. Steering Network Traffic

In some circumstances, the determination of which communication network to use to transfer packets of a particular flow must be made on the first packet of the flow. Because there can be multiple network paths (including different communication networks and layers of overlay tunnels) for transmitting data, traffic needs to be steered in a Wide Area Network (WAN). In many cases, once a flow transmission begins over a particular network path, all packets of the flow need to be transmitted over the same path. In addition, different types of data may be transmitted over differing network paths depending on whether the network is trusted or not.

Further, in many cases, internet traffic from a particular location is routed to one firewall that is located in a branch center or in a data center. However, in an environment where multiple firewalls are used for different kinds of traffic, routing data over some networks is more expensive than routing data over other types of networks. Additionally, better and more direct paths can be found from a source to a destination.

In an exemplary environment of FIG. 1A, an appliance in a network receives data packets for transmission. The appliance needs to determine in which direction to steer the data packets, depending on whether the data is associated with a trusted business application, a recreational application, or an untrusted/suspicious application. The determination of the application generating the data flow needs to be made on the first packet of the flow so that the appliance can send the data over the correct path. Further, while trusted business application data may be transmitted over the general Internet, recreational application may be sent to a cloud firewall. Untrusted or suspicious applications, such as traffic to prohibited or suspicious websites, may be sent to a data center. At the data center, this traffic may be logged, inspected for viruses/malware, or be treated more carefully by the appliance. Thus, it is important to know which application the data packets are associated with, before transmission can begin by the appliance.

In an exemplary environment of FIG. 2, one or more user computing devices are connected to a network appliance 220, also sometimes referred to herein as appliance 220. In the exemplary environment, the appliance 220 is connected to an MPLS network and an Internet network. A user computing device 210 may initiate a connection to an application 235 that is hosted by server 230. Server 230 is also sometimes referred to herein as application server 230. Typically, the application 235 can be any application that is accessible from the public Internet, such as any website, but the present disclosure is not limited to that embodiment. Application 235 can comprise an entire application, or simply a part of an application. That is, application 235 can be hosted by a single server, or by a combination of servers. Each server may be physical or virtual, and each server may be in different geographic locations. For example, in one embodiment, application 235 may provide a web-based email service hosted by a single server. In another embodiment, application 235 may provide a news aggregation service, with news articles provided by multiple servers located in different geographic locations.

Based on the IP address of server 230 that is hosting application 235, and/or the location of server 230, embodiments of the present disclosure provide for an inference to be made as to the name of the application 235 hosted by server 230. For example, by learning which destination server IP addresses are associated with which application names, the name of application 235 can be inferred in the future from the destination server IP address in a data packet transmitted by user computing device 210 to initiate a connection with application 235.

While the exemplary environment of FIG. 2 depicts just one server 230 for the application 235, there can actually be many physical or virtual servers at a geographic location hosting the application 235. Furthermore, while not depicted here, there can be any number of additional network components present, such as load balancers, routers, switches, firewall, etc. There may also be layers of address translation inside a data center hosting application 235, such that the apparent server IP address for server 230 appears different publicly than internally inside the data center. For simplicity, a single server 230 is described here with a single public IP address. However, a person of ordinary skill in the art will understand that the single server scenario depicted herein can be generalized to more complicated scenarios involving multiple servers.

The user request to access the application 235 hosted at the location may be routed by appliance 220 directly through the Internet, or through an MPLS network to private data center 260 first, and then over the Internet. There may additionally be one or more firewalls along either or both paths.

The traffic originating from user computing device 210 may have a private source IP address such as a.b.c.d, and a destination IP address for server 230 of m.n.o.p., as shown in table 215 of FIG. 2. However, the appliance 220 and/or the firewall 225 may perform network address translation to alter the source IP to a different address such as e.f.g.h. While firewall 225 is depicted as being external to appliance 220, it may actually be internal to appliance 220 in some embodiments. If the data traffic is routed over path 240 to application server 230, then the flow between user computing device 210 and application server 230 will appear to the application server 230 as having an apparent source IP address of e.f.g.h and a destination IP address of m.n.o.p., as depicted in table 245 of FIG. 2.

In another embodiment, the data traffic from user computing device 210 to application server 230 is routed through the MPLS network first to a private data center 260. A firewall 265 in the private data center 260 may perform network address translation to a different source IP address, such as i.j.k.l. This network address translation could be performed by a firewall appliance, a server, a router or other device. Thus, the data traffic routed over path 250 to application server 230 will have an apparent source IP address of i.j.k.l at the application server 230 and a destination IP address of m.n.o.p., as shown in table 255 of FIG. 2. In this way, even though the user computing device 210 originating the flow is the same, the application server 230 views incoming traffic from path 240 as being different from incoming traffic from path 250 since the source IP address for traffic arriving on path 240 is different from the source IP address for traffic arriving on path 250.

Because of the network address translation, if a first packet of a flow is transmitted by appliance 220 to application server 230 over path 240, but a second packet of the same flow is transmitted by appliance 220 to application server 230 over path 250, the server will not recognize the two packets as belonging to the same flow. This can become problematic if, for example, a TCP handshake is conducted over path 240 and data traffic is transmitted over path 250. Thus, appliance 220 needs to select an appropriate network path for transmitting data from user computing device 210 to application server 230, such that the same network path is used for all packets of a given flow.

When steering traffic by appliance 220, a determination of which network path to take needs to be made on the first packet for each flow, as once traffic has started in one direction, the appliance 220 generally cannot change directions for the traffic flow. The selection of network path can be based on traffic type, name of application 235, destination IP address of the server 230, or any other such criteria. However, often a first packet is used to establish a connection between the two devices (such as a TCP SYN packet), and does not have much (if any) other information besides simply header information, as depicted in FIG. 1B. There may be no explicit information about traffic type or application name in the information in a first packet. As a result, these characteristics need to be inferred from the limited information that is available in the information in the first packet for the flow. While embodiments of the present disclosure refer to information in a TCP packet, a person of ordinary skill in the art would understand that this is equally applicable to packets of other types of protocols.

In exemplary embodiments of the present disclosure, a neural network or other such learning algorithm may be used by an appliance 220 to infer an application name and/or one or more application characteristics or “tags” from the limited information in a first packet of a flow. As used herein, an application characteristic may be any characteristic or property related to an application or traffic type. The characteristic may have multiple possible values of the key. For example, an application characteristic can be “safety” which represents the safety of the network traffic. This can have multiple key values, such as “very safe”, “safe”, “unsafe”, “dangerous”, etc. Furthermore, a “tag” as used herein may comprise a specific string, such as “safe”, or “unsafe”. In this way, a “tag” may represent a value of a “characteristic”, or be independent from a characteristic.

While the application name is discussed herein as the tracked parameter that is inferred, there can actually be an inference made for any other parameter. For example, the inference made by the appliance may be regarding a tag (safe/unsafe), or any other parameter.

II. Key Strings

Once an inference is made by the appliance, the appliance begins steering a particular data flow over a particular network path. In a later packet of the flow, the name of the application that the flow is associated with may be apparent from payload information in the data packet. In exemplary embodiments of the present disclosure, the appliance can track information regarding the application and corresponding key value and build/update one or more data structures to influence the learning algorithm for future inferences.

FIG. 3A depicts an exemplary table 300 that is constructed from selected information in a first packet of a flow. A string of information is built in a hierarchical manner in the depicted table. While the general term table is used here, a person of ordinary skill in the art would understand that the data can actually be stored in any type of data structure, including table(s), database(s), nodes, etc.

A network administrator can determine one or more strings of information to track. For example, a network administrator may determine a source IP address should be collected, along with the name of the corresponding application that the flow is associated with. In the exemplary table 300, a network appliance collects information regarding a source IP address, the name of the associated application (regardless of inference), and a counter for how many times that combination has been viewed. The counter indicates a confidence level of the inference. In exemplary table 300, the tracked string of information is shown on a row in a concatenated manner. However, as would be understood by persons of ordinary skill in the art, the information can be collected and stored in any manner.

Rows 320 and 330 of table 300 depicts that data traffic from source IP address a.b.c.d was associated with the application “Skype” three hundred times and data traffic from source IP address a.b.c.d was associated with the application “Amazon” one time. Row 310 shows the global counter for source IP address a.b.c.d, which is that the particular source IP address was encountered by the appliance three hundred one times. From the counter, confidence information can be gleaned as to how the accuracy of the predicted application name, as discussed herein.

Row 340 of exemplary table 300 shows that network appliance also steered traffic from a source IP address of e.f.g.h for a total of three times. Rows 350-370 show that one time data traffic from source IP address e.f.g.h was associated with an FTP (file transfer protocol) server, one time it was associated with the Google application, and one time it was associated with the Facebook application.

From table 300, a determination can be made as to how well an source IP address can predict the associated application. For example, with source IP address a.b.c.d, predicting that the data traffic is associated with the “Skype” application is overwhelmingly accurate (>99%), and thus using this source IP address to infer an application name is likely to yield a good inference. However, source IP address e.f.g.h is associated with FTP 33% of the times, Google 33% of the time, and to Facebook 33% of the time. Thus, simply knowing that an source IP address is e.f.g.h does not allow the appliance to make a good prediction as to which application the data traffic is associated with.

While table 300 tracks an source IP address, a person of ordinary skill in the art would understand that table 300 can actually track any singular field, such as destination IP address, IP source port, IP destination port, etc.

FIG. 3B depicts another exemplary table 375 that can be constructed from information regarding a source IP address, along with the name of the associated application for the flow. In the exemplary table, a network appliance collects information regarding a source IP address, the name of the application that the traffic from that source IP address is associated with (regardless of inference), a counter for how many times that combination has been viewed, and a counter for how many flows have represented that combination, to yield confidence information regarding the prediction. In the exemplary table 375, this information is shown on a row in a concatenated manner. However, as would be understood by persons of ordinary skill in the art, the information can be collected and stored in any manner. Table 375 of FIG. 3B encompasses similar information as table 300 of FIG. 3A, but requires less storage space at the appliance while still providing relevant information needed by the appliance to make an inference regarding application name.

Row 380 depicts that data traffic from source IP address a.b.c.d was associated with the application “Skype” three hundred times out of a total of three hundred one flows processed by the appliance within the tracked time period. Row 390 shows that network appliance also steered traffic from an source IP address of e.f.g.h for a total of three times. One time data traffic from source IP address e.f.g.h was associated with an FTP (file transfer protocol) server. While row 390 depicts this information with the exemplary notation “⅓”, a person of ordinary skill in the art would understand that any notation can be used to depict one out of three flows, including punctuation, spacing, etc.

From a table such as table 375, a determination can be made as to how well an source IP address can predict the application that data traffic is associated with. For example, with source IP address a.b.c.d, predicting that the data traffic is associated with the “Skype” application is overwhelmingly accurate (>99%), and thus using this source IP address to infer an application name is likely to yield a good inference. However, source IP address e.f.g.h is associated with FTP 33% of the times. Thus, simply knowing that an source IP address is e.f.g.h does not allow the appliance to make a good prediction as to which application the data traffic is associated with.

Again, while the table 375 of FIG. 3B tracks an source IP address, a person of ordinary skill in the art would understand that the table can actually track any singular field, such as destination IP address, IP source port, IP destination port, etc. Further, any combination of fields can be tracked in a manner similar to table 375.

In various embodiments, the exemplary tables 300 and 375 may store information regarding all flows observed by the network appliance within a particular time period, or any other limited window. After the expiration of the time period, the table(s) can be purged as discussed herein to accommodate for gathering of information of future flows. In other embodiments, the exemplary tables 300 and 375 may be dynamic. In some embodiments, such that the appliance may only track one possibility for each key, for instance the application from the most recent flow observed (for example, only the information in row 390 rather than the three rows 350, 360 and 370). In this way, the table does not have to store information about every flow observed by the appliance and the appliance can still infer application names without storing ever increasing amounts of data. More information regarding how data is accumulated in these data structures of the appliance is discussed below with respect to the pseudocode.

FIG. 4 depicts an exemplary table 400 for tracking another exemplary string, that of the combination of source IP address and destination IP address. Row 410 shows that data traffic from source IP address of a.b.c.d was destined for a destination IP address of e.f.g.h one time, and that traffic was for an FTP application. Row 420 shows that data traffic from source IP address of a.b.c.d was destined for a destination IP address of i.j.k.l a total of 25 times, and that traffic was associated with the Google application. Row 430 shows that data traffic from source IP address of a.b.c.d was destined for a destination IP address of m.n.o.p a total of 10 times, and that traffic was associated with the Amazon application.

By collecting this information, an appliance can infer how well a particular source IP address and destination IP address combination can predict the application name associated with the flow. If the combination is a good predictor, then that information can be used by the learning algorithm of the appliance to infer a classification of future data flows from the particular IP address combination.

FIG. 5 depicts an exemplary table 500 that is constructed from a destination IP address and a minimum of a source port and destination port. Typically when a person visits a website, the destination port is commonly port number 80 for http protocol and port number 443 for https protocol. However, the source port can be a random value. Also, the destination port is typically the smaller port number. By storing the minimum of the two ports, an inference can be made on the type of traffic based on the common port numbers.

In an exemplary embodiment, an appliance may have processed four different data flows: (1) a data flow processed one time for a destination IP address of a.b.c.d, destination port number 80, and source port number 30002, for an Oracle application; (2) a data flow processed one time for the same IP address, destination port number 80, and source port number 38955 for an Oracle application. This information can be combined and stored as row 510 in exemplary table 500 of FIG. 5. Only the minimum port number, 80, is stored in the table and the counter reflects that this information was processed two times by the appliance, within the tracked time period.

The appliance may further have processed data flow (3) for a destination IP address of e.f.g.h., destination port number 443, source port number 40172 for application name “Google”, and (4) one data flow for the same destination IP address, destination port number 443, source port number 39255, for the application name “Google”. This information can be combined and stored as row 520 in exemplary table 500. Only the minimum port number, 443, is stored in the table and the counter reflects that this information was processed two times by the appliance, within the tracked time period.

Since the source port will typically be a random number, tracking each port number combination would generate many rows, a significant portion of which will be unlikely to be good predictors of future flows due to the randomness of the port assignment. However, by storing only the minimum port number in the table, information regarding multiple data flows can be combined in each row (such as row 510) to show that data traffic for destination IP address of a.b.c.d and a minimum port number of 80 is associated with Oracle traffic. In this way, only information that is likely to be useful in a future prediction with a high level of confidence is tracked by the appliance.

Further, as discussed herein, table 500 may actually store only one row for each key (e.g. IP address, or IP address and port combination) and the most likely application associated with the key, rather than multiple rows for every application associated with the key. In addition, while not depicted in FIG. 5, table 500 may store a counter for how many times the particular application association was processed out of the total number of flows with the same key, to track the accuracy and/or confidence level of the prediction.

In this way, similar tables can be constructed for any field or combination of fields—not only the IP address and port combinations discussed herein. Similarly, tables can be constructed for various packet properties, such as packet length, optimization system, encryption status, etc. Similar tables can also be constructed for application characteristics and/or application tags. Further, while tables are discussed herein, a person of ordinary skill in the art would understand that any type of data structure can be utilized.

III. Building Key Strings

FIG. 11 depicts an exemplary method undertaken by a network appliance (such as appliance 220 of FIG. 2) in computing a key from packet data. In step 1110, appliance 220 receives a first packet of a new flow. The appliance 220 then extracts information from the first packet in step 1120 (using a feature extraction engine). As discussed herein, the first packet may contain only header information if it is, for example, a TCP SYN packet. In other embodiments, the first packet may have more than just header information. In any case, the extraction engine of appliance 220 extracts the information available from the first packet for the flow. In step 1130, any transformation may optionally be applied to the extracted data. The transformation may include determining the minimum port number, as discussed above with reference to FIG. 5, or any other transformation. In step 1140, the extracted and optionally transformed data are combined into a key. The key value is optionally transformed in step 1150, such as hashed.

Exemplary pseudocode that may be utilized to accomplish this method is shown below.

How to compute a key from packet [header] data:

-   -   1. Receive [first] packet of a flow     -   2. Extract one or more fields from packet [header], e.g. a         combination of source/destination IP address, source/destination         port, protocol     -   3. Optionally apply a transformation to the extracted data e.g.         minport=min(destination port, source port)     -   4. Combine the extracted and optionally transformed data into a         key e.g. 8 bytes of source IP+destination IP     -   5. Optionally transform the key (e.g. compute key=hash(key))

FIG. 12 depicts an exemplary method undertaken by a network appliance such as appliance 220 of FIG. 2, when a first packet of a flow arrives. In step 1210, the appliance builds a key using the first packet information. The key and its associated flow information can optionally be stored at the appliance in step 1220. Information regarding when new information is stored in a table and when it is not stored is discussed herein.

In step 1230, a determination is made as to whether the key is present in one or more data structures at the appliance. If not, then no prediction or inference is made by the appliance. If yes, then a determination is made in step 1240 if the application prediction meets a confidence level threshold. If the prediction does meet a predetermined confidence level threshold, then a prediction is returned. If not, then no prediction is returned. If a prediction is returned, then the appliance may determine a next hop along a network path, for transmission of the data flow. If no prediction is returned, then the data flow may be dropped by the appliance, or a next hop along a default network path is chosen by the appliance for transmission of the data flow.

In various embodiments, the requisite confidence threshold for returning a prediction can be any value determined by a network administrator, and can be adjusted as needed. Further, the confidence threshold can be variable depending on any parameter, such as source IP address, destination IP address, source port, destination port, protocol, application name, etc. That is, different parameters may have different confidence thresholds for returning a prediction and utilizing the prediction by the appliance in determine how to process a data packet.

Furthermore, the confidence level for a particular prediction may be gleaned from one table (such as exemplary tables 300, 375, 400, and 500), or from a combination of different tables. That is, a key may be present in multiple data structures at the appliance. Each data structure may have the same confidence level for the key, or different confidence levels for the key. A mathematical operation may be used to combine the information in multiple tables and determine an aggregate confidence level for the key. The aggregate confidence level may be determined using any mathematical operation, neural network, or through any other mechanism. Furthermore, each data structure may have its own confidence level, separate and apart from a confidence level for a particular key in the data structure. In various embodiments, a confidence level for a particular key may be combined with a confidence level for the data structure it appears in, to determine an aggregate confidence level. This aggregate confidence level may be compared to the confidence threshold to determine whether the appliance should rely on the prediction or not.

For example, if a particular source IP address is present in a source IP address table such as table 375, and also present in a table such as table 400 that tracks source IP address/destination IP address combinations, then the confidence level of the source IP address from each table may be combined to yield an aggregated confidence level for the source IP address.

Exemplary pseudocode that may be utilized to accomplish this method is shown below.

What to do when first packet of a flow arrives (can do this for multiple key types, with a separate data structure for each):

-   -   1. Build a key (using this first packet)     -   2. Optionally save the key with its associated flow     -   3. Look up key in data structure (could be a hash table, a         sorted list of keys+nodes etc.)     -   4. If key is not found         -   a. Do nothing yet         -   b. Make no prediction     -   5. If key is found         -   a. Examine node data for this key         -   b. Is there an [application name] prediction which meets our             confidence threshold?             -   i. YES—return prediction (and confidence)             -   ii. NO—make no prediction

In an example implementation, each node of a data structure may have at least three pieces of information: total count, success count, and name (a string name of the predicted application). A confidence level is computed as Success Count/Total Count. If the confidence level is >99%, return name. Otherwise, no prediction is returned. As discussed above, the confidence level required to return an application name prediction can be variable. Further, the confidence level threshold required to return an application name prediction can be either the confidence level associated with a particular key in one data structure, a confidence level associated with a key in multiple data structures, a confidence level associated with a key and a data structure, or any combination of the above.

FIG. 13 depicts an exemplary method undertaken by a network appliance when the final application name of a flow is determined. In step 1310, the appliance builds or restores a key using the first packet information. The restoring if the key was optionally saved in a prior step. In step 1320, a determination is made as to whether the key is present in one or more data structures at the appliance. If not, then a node is initialized in the data structure for the key. If yes, then a determination is made in step 1330 as to whether the application prediction was correct. The node information and optionally the table confidence information is updated accordingly.

Exemplary pseudocode that may be utilized to accomplish this method is shown below.

What to do when the final application name of a flow is determined:

-   -   1. Either         -   a. Build a key (using either the latest packet or the save             first packet—either works for header information, if payload             is included in key, preferably use the first packet), or         -   b. Restore the key saved for this flow (see optional step 2             above)     -   2. Look up key in data structure     -   3. If key is not found         -   a. Initialize a node for this key in the data structure         -   Example implementation             -   Total Count=1             -   Success Count=1             -   Name=final application name     -   4. If key is found         -   a. If the prediction was correct (predicted name=final             application name)             -   i. Optionally update the table confidence tracking                 information based on a successful prediction             -   ii. Update the node information based on a successful                 prediction                 -   Example Implementation                 -    Total Count+=1                 -    Success Count+=1                 -    If (Total Count>Max Count)//optional scaling                 -    Total Count=Total Count/2                 -    Success Count=Success Count/2         -   b. If the prediction was wrong (predicted name does not             equal final application name)             -   i. Optionally update the table confidence tracking                 information based on an incorrect prediction             -   ii. Update the node information based on an incorrect                 prediction

In an example implementation for immediate replacement of a key string in a data structure, Total Count=1, Success Count=1, Name=final application name. While the application name did have 100% accuracy, there was only one instance of it. Thus, this is determined to not be a good predictor of application name due to the low sample size, and the field can be replaced with updated information when a new data flow is processed by the appliance.

In an example implementation for conditional replacement of a key string in a data structure, exemplary pseudocode that may be utilized to accomplish this is presented below:

If (Total_Count>5 && Success Count/Total Count>80%)     // don't replace just yet     Total Count+=1     // optionally penalize further     Success Count = Success Count * 0.9 Else   // restart prediction with new name as hypothesis   Total Count = 1   Success Count = 1   Name = final application name

Furthermore, as discussed above, the information that is tracked such as in exemplary tables 300, 375, 400 and 500 can be periodically purged to remove the items that are outdated, not good predictors, and/or to save storage space in the memory of an appliance. In some embodiments items that are not useful predictors might also be purged. For instance, if the prediction application association is already definitely known from data in the first packet. Exemplary pseudocode that may be utilized for background maintenance on the tables in the appliance is shown below.

Background maintenance (periodic or triggered when data structure is nearly full):

-   -   1. Delete all nodes that have a total count <X     -   2. Delete all nodes that have not been accessed since time X         (need to have an access time stored in each node)

A data structure may be considered to be nearly full or heavily utilized when a predetermined percentage of the available space has been utilized. Furthermore, either one or both of the criteria from the pseudocode may be satisfied before nodes are deleted. Other more complicated deletion criteria could be used. In other embodiments, the data structure can be purged periodically, based on elapse time, even when it is not full.

While the above embodiments are discussed in terms of predicted application names, the present disclosure can also be used to predict one or more application tags instead of, or in addition to, application names. Data structures such as those described in reference to FIGS. 3-5 can be used to track application tags instead of, or in addition to application names. Thus, a network appliance may be able to predict one or more tags to classify a flow and aid in steering the flow over the proper network path.

In one example, an appliance may have a table with a particular source IP address and destination IP address combination. The application name associated with that IP address combination may not meet a predetermined confidence level threshold, however a particular application tag may meet a predetermined confidence level threshold and thus used in the prediction. For example, the tag may denote that the data is likely “safe” or “unsafe”, which can determine whether the flow is processed as a trusted business application or potentially malware for which further inspection is prudent. Further, the tag may denote a type of traffic, such as data, video, voice, etc., enabling the network appliance to implement a particular policy for handling the traffic types, despite not knowing the name of the specific application with a high level of confidence.

IV. Predicting Classification of Data Flows

As discussed above, the tables stored in the appliance may be periodically culled to only keep the data that is a good predictor, and discard data that does not yield a good prediction. “Good” prediction may be determined by evaluating subsequent packet data, as discussed above.

Furthermore, a network administrator may determine a threshold for a success count necessary before a prediction can be made, a threshold for a success count for keeping information in the tables, and/or a threshold for when rows are culled from a table, such as tables 300, 375, 400, and 500. In addition, to prevent the tables from continuously becoming larger, the tables may be stored as a hash, instead of as direct data.

FIG. 8 depicts an exemplary method undertaken by a network appliance such as appliance 220 of FIG. 2, when steering traffic. In step 805, appliance 220 receives a first packet of a new flow. The appliance 220 then extracts information from the first packet in step 810 using a feature extraction engine. As discussed herein, the first packet may contain only header information if it is, for example, a TCP SYN packet. In other embodiments, the first packet may have more than just header information. In any case, the extraction engine of appliance 220 extracts the information available from the first packet for the flow. A simple inspection engine (such as inspection engine 910 of FIG. 9) is used to analyze the extracted information in step 815. A determination is made whether this information is indicative of known application names and/or one or more tags. An inference engine (such as inference engine 920 of FIG. 9) is then used to infer an application name and one or more application tags in step 820.

If the extracted information is indicative of known application names and/or tags, then the inference engine 920 uses the known mapping to classify the flow as belonging to the known application name and/or application tags or characteristics. If the extracted information is partially indicative of known application names and/or tags, or is not indicative of any known application names and/or tags at all, then an inference is made as to the application name associated with the flow and/or one or more application tags or characteristics. In some embodiments, the inference engine 920 is unable to make any inference as to application name and/or tag(s) and returns a value of “unknown”. In various embodiments, a confidence percentage can be used by appliance 220 for the inspection engine 910 and/or the inference engine 920. For example, the engines may need to determine an application name and/or tag with a predetermined level of confidence before selecting that application name and/or tag as corresponding to the data in the packet being analyzed. The predetermined confidence level can be preset or be variable for different appliances, application names, tags/characteristics, enterprises, or based on time.

Once the appliance determines the application name and/or tag(s) via inference engine 920, the appliance determines a network path over which to transmit the flow in step 825. The selection of a path can be based on any number of factors. For example, the appliance may have a policy that all voice over IP traffic should be routed over an MPLS network while data traffic is routed over the public Internet. A determination from the inference engine 920 aids the appliance in determining which path to use for the flow. In some embodiments, if the inference engine 920 is unable to make an inference, then a default path may be selected.

When the appliance receives a second packet of the same flow in step 830, the second packet may continue to be routed over the chosen path for the first packet. However, the appliance may still analyze and extract information from the second packet to improve the learning and inference of the inference engine 920. Thus information can be extracted from the subsequent packet in step 835. Typically the subsequent packet may contain more information than was present in the first packet of the flow, and thus more information can be gleaned from this packet. Furthermore, information can be gleaned from a combination of data packets, and not simply a singular packet. That is, there may be data, such as an embedded domain name, that spans across multiple packet boundaries. For example, one packet may have “www.go” embedded within it, while a subsequent packet has “ogle.com” embedded within it. The domain name can be gleaned from a combination of the information in the two packets. While only two packets are discussed here, information can be gleaned from a combination of any number of packets.

Deep packet inspection, using any of the known methods, can be performed on the extracted information from the subsequent packet in step 840. The deep packet inspection will typically yield additional information about the associated application. This additional information can be useful for other future flows, such as FTP (File Transfer Protocol) control channel or DNS (Domain Name Server) queries. This additional information might not change the direction of routing for the current flow, but rather inform how future flows are handled by the appliance. In some embodiments, the deep packet inspection may find that the inferred application name and/or one or more inferred application tags or characteristics originally determined by the inference engine 920 for the first packet in step 820 was incorrect. The information is passed on to the inference engine 920 in step 845.

In other embodiments, the deep packet inspection may find that the inferred application and/or inferred tags originally determined for the first packet in step 820 was correct, but additional application characteristics or tags are gleaned from the deep packet inspection. This augmented information is passed on to the inference engine 920 in step 845 while traffic continues to be routed over the selected path for the flow. In step 850, the augmented application characteristics can be used to determine flow settings, such as quality of service or flow prioritization.

In step 855, a determination is made by the appliance whether the augmented information gleaned from a subsequent packet contradicts the original inference. Additionally, a confidence level for the contradiction may be determined, such that the augmented information can contradict the original inference on a sliding scale from strong to weak. If there is no contradiction, then the subsequent packet continues to be routed 860 over the path determined in step 825. If there is a contradiction with a low level of confidence, then the subsequent packet continues to be routed over the path determined in step 825. If there is a contradiction with a high level of confidence, then the appliance 650 may drop the packet in step 865 and optionally reset the connection (e.g., with a RST packet). In alternate embodiments, if there is a contradiction with a high level of confidence in step 865, the appliance may decide to route further packets on a new path associated with the augmented information, thus changing direction mid-flow. The destination server may not recognize the packets from the different path and reset the connection automatically.

It will be understood that where the term second packet is used herein, the process applies to any subsequent packet in the flow, regardless of whether it is actually chronologically the second, third, tenth, or any later packet. Further, the deep packet inspection may be performed for only one subsequent packet of a flow, or for multiple subsequent packets of a flow. In this way, a learning algorithm at the inference engine 920 is continually updated such that the inference made on the first packet can continue to be refined and the optimal path can be chosen for a given flow based only on limited information in the first packet of the flow.

In the exemplary environment of FIG. 2, appliance 220 receives traffic destined for application server 230. Based on information in the first packet (source IP a.b.c.d, destination IP m.n.o.p and TCP protocol), and observations of past history of flows with similar information, the appliance 220 may infer that this flow is for a particular application 235 hosted at server 230 and has a tag of “data” for file transfer traffic. Consequently, the appliance 220 may choose to transmit data through the Internet via path 240.

A subsequent packet of the same flow may contain information to determine that the flow is actually streaming video and thus the tag should have been “video” and not “data”. Thus, the traffic type classification inferred by appliance 220 from the first packet was incorrect, and updates are made by the learning algorithm such that a subsequent flow with similar extracted information from the packet is classified as being streaming video traffic and not data traffic. In some embodiments, an incorrect classification may be detected a certain number of times before the learning algorithm alters the inferred application name, application characteristic(s), and/or one or more inferred application tags based on information in the first packet.

In other embodiments, information such as a timestamp may be used in conjunction with extracted information to infer an application name, application characteristic(s) and/or tags. For example, appliance 220 may determine that every Tuesday at 10 am, user computing device 210 initiates a Voice over IP (VoIP) call. Thus traffic from a.b.c.d at that time is for VoIP, whereas at other times it is data. Upon observing traffic flows in this way, a distributed deep learning algorithm can determine patterns for traffic flowing through appliance 220 and use these patterns to better classify and infer data traffic flows from only information present in a first packet for each flow.

In various embodiments, the inference engine at an appliance can be in communication with other databases to help refine the inference made on the first packet. As depicted in FIG. 9, the inference engine 920 at every appliance 650 in the overlay network can be in communication with the orchestrator 710, which manages all of the appliances at a given enterprise. For example, if an enterprise has multiple network appliances deployed in various locations of its WAN, information from all of the inference engines at each appliance can be aggregated over the enterprise and be maintained by one or more data structures (such as a database) at the orchestrator 710 to provide more data points for the distributed deep learning algorithm and perform more accurate classification on the first packet. Furthermore, machine learning can be used at the orchestrator 710 to combine information received from the network appliances in the network.

In addition, a user such as a network administrator can customize the inference for a particular set of packet information such that flows are classified in a particular manner. In this way, the learning algorithm in a particular network appliance can be informed by data inspected through that one appliance and also by data inspected at other appliances throughout the enterprise.

Further, information from multiple enterprise orchestrators can be aggregated in a cloud-based system, along with information from third party databases, to better inform the distributed deep learning algorithm of the neural network and allow each network appliance to perform more accurate classification and inference on the first packet for various flows.

Similarly, information from the cloud intelligence can be communicated to an orchestrator 710, which in turn can be relayed to an appliance 650 at a location. In this way, an inference engine 920 at an appliance at one location can have the benefit of data points from multiple appliances, orchestrators, and third party databases, to aid in its inference. The cloud-based system can also use machine learning techniques applied to the data it receives from different sources. The cloud-based system can determine and evaluate trends across multiple orchestrators (and hence enterprises) and distribute classification and inference information back to each orchestrator 710 and appliance 650, as depicted in FIG. 9.

FIG. 10 depicts an exemplary analysis that is conducted on packet information to classify a flow. Information from a packet is extracted by a feature extraction engine. The feature extraction engine may extract information such as IP protocol, TCP/UDP port, domain name, subnet/IP, any result from deep packet inspection methods, and an artificial intelligence inference. While these specific features are shown in FIG. 10, a person of ordinary skill in the art would understand that there can be a different set of features or fewer or additional features extracted for any given packet.

A first packet for a flow may only have a few features available, such as IP protocol, TCP/UDP port, and subnet/IP. A subsequent packet for the flow, or combination of subsequent packets, may have one or more additional features that can be extracted, such as an embedded destination domain name. As discussed above, the domain name or other information may span across multiple packets.

From the extracted features, mapping tables are used to map each feature to an application name, priority, and/or one or more tags for the flow. For example, a mapping table may determine that an IP protocol of 6 is for TCP data with a priority of 2. A mapping table may further determine that port number 443 is for https traffic with a priority of 50. A further mapping table may determine that googlevideo.com is for the application name YouTube, which has a priority of 70 and tags of “video”, “streaming”, “recreational”, and “safe”.

From these mapped values, the highest priority mapped value may be determined to represent the flow by a prioritization and concatenation engine. In the exemplary embodiment of FIG. 10, the highest priority is 70 and it is indicative of the application “YouTube” with tags of “video”, “streaming”, “recreational” and “safe”. Further, the concatenation engine may also determine that the traffic uses https, and so an application name of “YouTube-https” is determined for the flow. In various embodiments, a characteristic can comprise a key-value pair. For example, “traffic type: video”, “business relevance: high”, “business relevance: personal”.

In various embodiments, the feature extraction process may be performed on a first packet for a flow and/or on one or more subsequent packets for the same flow.

In various embodiments, a domain name and/or subnet can be inferred from an IP address. A DNS table may be consulted with information regarding corresponding domain names and IP addresses. However, since there are many IP addresses in different addressing system, maintaining a local DNS table for every possible IP address is cumbersome. In some embodiments, caching or other similar methods can be used to maintain a subset of DNS information in a location accessible by a network appliance.

In another embodiment, a map can be maintained and distributed from a portal in the orchestrator to all appliances. The map may contain information such as a range of IP addresses or a subnet, the organization/owner of that range, and a geolocation for that range. For example, IP addresses from 0 to X1-1 may correspond to Company A located in San Francisco, Calif. IP addresses from X1 to X2-1 may correspond to Company B located in Chicago, Ill. IP addresses from X2 to X3-1 may correspond to Company C located in Miami, Fla. In this way, a subnet/IP can be inferred from a single IP address.

In a third embodiment, DNS snooping can be used to determine a mapping from a domain name to an IP address. A DNS server may be located in the private data center, at the application 235, or at any other location in the network. When a user computer, such as the user computing device 210 of FIG. 2, sends a request to the DNS server for the IP address associated with a domain name or website, the DNS server responds with the IP address and domain name. The appliance, such as appliance 220 of FIG. 2, can intercept the DNS response to user computing device 210 and create a cached table such that the information is available for future requests to that domain name. Further, this information can be aggregated across all appliances in the enterprise network and maintained in a central location such as in the orchestrator.

In a fourth embodiment, deep packet inspection methods can be used to determine the domain name. For example, a first packet for a flow may have only header information. However, a fourth packet may have information about the destination domain name in the payload of the packet. Thus, deep packet inspection methods can yield the domain name associated with the destination IP address in the header. This information can be aggregated across all appliances and maintained in a central location such as in the orchestrator.

V. System Setup

FIG. 14 illustrates an exemplary system 1400, within which the present disclosure can be implemented. The exemplary system 1400 includes a first location 110, a second location 120, and communication networks 130A-130D. While four communication networks are depicted in exemplary system 1400, there can be any number of communication networks, including just one. Additionally, system 1400 can include many locations, though only two are depicted in the exemplary figure for simplicity.

In the exemplary embodiment depicted in FIG. 14, the first location 110 includes computers 140 and a first appliance 150. In the first location 110, the computers 140 are linked to the first appliance 150. While only one appliance is depicted in first location 110, there can be multiple appliances, physical and/or virtual, at first location 110. In some embodiments, the first location is a branch location of an enterprise. While not depicted here, first location 110 can also comprise additional elements such as routers, switches, or any other physical or virtual computing equipment.

Computers 140 may be any type of computing device capable of accessing a communication network, such as a desktop computer, laptop computer, server, mobile phone, tablet, or any other “smart” device.

The first appliance 150 comprises hardware and/or software elements configured to receive data and optionally perform any type of processing before transmitting across a communication network.

As illustrated, the first appliance 150 is configured in-line (or serially) between the computers 140 and the router 160. The first appliance 150 intercepts network traffic between the computers 140 and the servers 170, in either direction.

In other embodiments, the first appliance 150 can be configured as an additional router, gateway, bridge, or be transparent on some or all interfaces. As a router, for example, the first appliance 150 appears to the computers 140 as an extra hop before the router 160. In some embodiments, the first appliance 150 provides redundant routing or peer routing with the router 160. Additionally, the first appliance 150 may provide failure mechanisms, such as, fail-to-open (e.g., no data access) or fail-to-wire (e.g., a direct connection to the router 160). If an appliance has multiple interfaces, it can be transparent on some interfaces, or act like a router, or act like a bridge on others. Alternatively, the appliance can be transparent on all interfaces, or appear as a router or bridge on all interfaces.

In FIG. 14, the first appliance 150 is linked to a router 160, which is coupled to communication networks 130A and 130B. While only one router 160 is depicted in exemplary system 1400, there can be multiple routers, switches, or other equipment (physical or virtual) present in system 1400, either within the first location 110 or outside of the first location 110. Typically, router 160 would be located within first location 110. In various embodiments, first appliance 150 may be in communication with communication networks 130C and 130D directly (on separate interfaces), instead of through router 160. While router 160 is depicted as being connected to two communication networks and first appliance 150 is also depicted as being connected to two communication networks, a person of ordinary skill in the art would understand that there can be any number of communication networks (including just one communication network) connected to the first location 110, either via router 160, via first appliance 150, or via another computing device. To illustrate that each of the access links is possible but not required in every embodiment, the access links 125 are shown as dashed lines in FIG. 14.

The second location 120 in exemplary system 1400 includes servers 170. While the term “server” is used herein, any type of computing device may be used in second location 120, as understood by a person of ordinary skill in the art. The server may also be a virtual machine. While not depicted in FIG. 14, second location 120 can optionally include at least one second appliance in addition to, or instead of, servers 170. Second location 120 can also include other components not depicted in FIG. 14, such as routers, switches, load-balancers or any other physical or virtual computing equipment. In some embodiments, the second location 120 is a central location or data center for an enterprise. In other embodiments, the second location 120 is a data center hosting a public web service or application.

The servers 170 are depicted in FIG. 14 as being linked to the communication networks 130A-130D via destination access links 145. In some embodiments, servers 170 may actually be in communication with the one or more of the communication networks through a router, switch, second appliance, or other physical or virtual equipment. Further, while four destination access links 145 are depicted in FIG. 14, for four communication networks (130A-130D), there may actually be fewer (such as just one) or more communication networks connected to second location 120. To illustrate that each of the destination access links 145 is possible but not required in every embodiment, the destination access links 145 are shown as dashed lines in FIG. 14.

The communication networks 130A-130D comprise hardware and/or software elements that enable the exchange of information (e.g., voice, video and data) between the first location 110 and the second location 120. Some examples of the communication networks 130A-130D are a private wide-area network (WAN), the public Internet, Multiprotocol Label Switching (MPLS) network, and wireless LTE network. Typically connections from the first location 110 to the communication networks 130A-130D (e.g., from router 160 and first appliance 150) are T1 lines (1.544 Mbps), or broadband connections such as digital subscriber lines (DSL) and cable modems. Other examples are MPLS lines, T3 lines (43.232 Mbps), OC3 (155 Mbps), OC48 (2.5 Gbps), fiber optic cables, or LTE wireless access connection. In various embodiments, each of the communication networks 130A-130D may be connected to at least one other communication network via at least one Inter-ISP link 155. For example, communication network 130A may be connected to communication network 130B, 130C, and/or 130D via one or more inter-ISP links. Data may traverse more than one communications network along a path from first location 110 to second location 120. For example, traffic may flow from the first location 110 to communication network 130A, over inter-ISP link 155 to communication network 130B, and then to the second location 120.

The router 160 and first appliance 150 are optionally connected to the communication networks 130A-130D via access links 125, sometimes also referred to herein as network access links. The communication networks 130A-130D consist of routers, switches, and other internal components that make up provider links 135. The provider links 135 are managed by the network service providers such as an Internet Service Provider (ISP). The second location 120 can be connected to communication networks 130A-130D via destination access links 145. Access links 125, provider links 135, and destination access links 145 can be combined to make various network paths along which data travels between the first location 110 and the second location 120. The exemplary embodiment of FIG. 14 depicts two paths along various provider links 135 through each communication network. However, as understood by persons of ordinary skill in the art, there can be any number of network paths across one or more communication networks.

In addition, communication networks may be in communication with one another via inter-ISP link(s) 155. For example, data traveling through communication network 130A may also travel through communication network 130C before reaching second location 120. In various embodiments, data can travel through any one or more of the communication networks 130A-130D from first location 110 to second location 120, and vice versa. Generally, an inter-ISP link connects communication networks of different internet service providers, such as a link connecting Verizon LTE wireless network with Comcast broadband network. In some embodiments, an inter-ISP link can connect communication networks from the same internet service provider, such as a link connecting Verizon LTE wireless network with the Verizon Fire network.

The first appliance 150, along with any other appliances in system 1400 can be physical or virtual. In the exemplary embodiment of a virtual appliance, it can be in a virtual private cloud (VPC), managed by a cloud service provider, such as Amazon Web Services, or others. An appliance in a customer data center can be physical or virtual. Similarly, the second location 120 may be a cloud service such as Amazon Web Service, Salesforce, or others.

As discussed herein, the communication networks 130A-130D can comprise multiple provider links, made up of routers and switches, connecting networked devices in different locations. These provider links, which together form various paths, are part of one or more core networks, sometimes referred to as an underlay network. In addition to these paths, there can also be tunnels connecting two networked devices. A virtual network, sometimes called an overlay network, can be used to transmit data across an underlay network, regardless of which Service Provider manages the routes or provider links. Data from connected devices can travel over this overlay network, which can consist of any number of tunnels or paths between each location.

In an exemplary embodiment, data from computers 140 at first location 110 may include voice, video, and data. This information can be transmitted by first appliance 150 over one or more communication networks 130A-130D to second location 120. In some embodiments, voice, video, and data may be received and transmitted on separate LAN or vLAN interfaces, and first appliance 150 can distinguish the traffic based on the LAN/vLAN interface at which the data was received.

In some embodiments, the system 1400 includes one or more secure tunnels between the first appliance 150 and servers 170, or optionally a second appliance at the second location. The secure tunnel may be utilized with encryption (e.g., IPsec), access control lists (ACLs), compression (such as header and payload compression), fragmentation/coalescing optimizations, and/or error detection and correction provided by an appliance.

In various embodiments, first location 110 and/or second location 120 can be a branch location, central location, private cloud network, data center, or any other type of location. In addition, multiple locations can be in communication with each other. As understood by persons of ordinary skill in the art, any type of network topology may be used.

The principles discussed herein are equally applicable to multiple first locations (not shown) and to multiple second locations (not shown). For example, the system 1400 may include multiple branch locations and/or multiple central locations coupled to one or more communication networks. System 1400 may also include many sites (first locations) in communication with many different public web services (second locations). Branch location/branch location communication, central location/central location communication, central location/cloud appliance communication, as well as multi-appliance and/or multi-node communication and bi-directional communication are further within the scope of the disclosure. However, for the sake of simplicity, FIG. 14 illustrates the system 1400 having a single first location 110 and a single second location 120.

FIG. 6 illustrates a block diagram of an appliance 650 (also referred to herein as network appliance), in an exemplary implementation of the invention. Appliance 650 may be similar to appliance 220 of FIG. 2 and first appliance 150 of FIG. 14, as discussed herein. The appliance 650 includes a processor 610, a memory 620, a WAN communication interface 630, a LAN communication interface 640, and database(s) 690. A system bus 680 links the processor 610, the memory 620, the WAN communication interface 630, the LAN communication interface 640, and the database(s) 690. When deployed in a branch location, line 660 links the WAN communication interface 630 to the router 160 (in FIG. 14), and line 670 links the LAN communication interface 640 to the computers 140 in FIG. 14.

The database(s) 690 comprises hardware and/or software elements configured to store data in an organized format to allow the processor 610 to create, modify, and retrieve the data. The hardware and/or software elements of the database(s) 690 may include storage devices, such as RAM, hard drives, optical drives, flash memory, and magnetic tape.

In some embodiments, some appliances comprise identical hardware and/or software elements. Alternatively, in other embodiments, some appliances, such as a second appliance, may include hardware and/or software elements providing additional processing, communication, and storage capacity.

Embodiments of the present invention also allow for centrally assigned policies to be implemented throughout an organization's entire network, to secure and control all WAN traffic for the organization. Software defined WAN (SD-WAN) overlay networks can be created independently from the physical network, and from each other, and in multiple layers. Topology, security, and forwarding rules can be specified independently for each overlay. This design allows for high-scale and secure application segmentation. Each overlay scales automatically as endpoints are added to the SD-WAN fabric, and configuration integrity is maintained as each site maps a local profile into a global overlay.

All of the overlay networks, labels, and corresponding ports, subnets and vLANs can be maintained in one or more databases in communication with an orchestrator device, as depicted in FIG. 7. The orchestrator 710 can be hardware and/or software, and be in communication with each of the networked devices, such as the network appliances, as well as in communication with the database(s) 720.

In exemplary embodiments, the orchestrator 710 may maintain information regarding the configuration of each appliance at each location (physical or virtual). In this way, the orchestrator 710 can create, manage and implement policies for network traffic throughout the network of connected appliances. For example, if a higher priority is designated for voice traffic, the orchestrator 710 can automatically configure the corresponding network appliances at all relevant locations accordingly.

By having knowledge of the configuration of each appliance in the network, the orchestrator 710 can also create and manage tunnels in the enterprise network, including tunnels to carry a particular type of network traffic between each source-destination appliance pair. The orchestrator 710 can automatically configure the enterprise network by determining which tunnels need to be set up, and automatically creating them based on the network nodes and overlays. The orchestrator 710 can also configure policies based on the application classification techniques described herein to preferentially steer certain types of applications over one path rather than over another path.

In exemplary embodiments, network interfaces of a network appliance 650 can be designated on the WAN side and LAN side as processing a specific type of traffic, or traffic from specific applications. For example, a first WAN interface may connect to the public Internet, while a second WAN interface connects to an MPLS service. Both WAN interfaces can support encryption and the Internet uplink can be configured for Network Address Translation (NAT).

Thus, methods and systems for multi-level learning for classifying traffic flows from first packet data are disclosed. Although embodiments have been described with reference to specific examples, it will be evident that various modifications and changes can be made to these example embodiments without departing from the broader spirit and scope of the present application. Therefore, these and other variations upon the exemplary embodiments are intended to be covered by the present disclosure. Accordingly, the specification and drawings are to be regarded in an illustrative rather than a restrictive sense. 

What is claimed is:
 1. A method of selecting a network path for transmitting data across a network based on header information extracted from a first data packet of a data flow, the method comprising: receiving at a first network appliance, a first data packet of a data flow to be transmitted across a network; extracting information from a header of the first data packet of the data flow; generating a key representing the extracted information from the header of the first data packet of the data flow, the key having one or more possible key values; tracking information regarding the first network appliance and the one or more key values of the key; verifying that the key is present in a data structure at the first network appliance, the data structure further including information extracted from data packets of another data flow, the another dataflow commencing before the data flow; predicting an associated application name for the data flow based on the key; verifying that the application prediction in the data structure at the first network appliance meets a confidence threshold; based on the application prediction, building or updating the data structure to influence a learning algorithm for future inferences; selecting, by the first network appliance, a network path based on the application prediction; and transmitting the first data packet of the data flow by the first network appliance based on the selected network path.
 2. The method of claim 1, further comprising: receiving a subsequent data packet of the data flow; determining an application name from payload information of the subsequent data packet of the data flow; verifying that the application prediction based on the first data packet was correct; and updating confidence information in the data structure for the key associated with the extracted information from the header of the first data packet, wherein the confidence information comprises a counter.
 3. The method of claim 1, further comprising: receiving a subsequent data packet of the data flow; determining an application name from payload information of the subsequent data packet of the data flow; determining that the application prediction based on the first data packet was incorrect; and updating confidence information in the data structure for the key associated with the extracted information from the header of the first data packet.
 4. The method of claim 1, further comprising transforming the extracted information from the header of the first data packet prior to generating the key.
 5. The method of claim 1, further comprising transforming the generated key.
 6. The method of claim 5, wherein the transforming the generated key comprises hashing the generated key.
 7. The method of claim 1, further comprising: performing network address translation based on the selected network path to change at least one of a source network address, destination network address, destination port, and a source port in packets of the data flow.
 8. A method for inferring an application name from header information extracted from a first data packet of a data flow, the method comprising: receiving at a first network appliance, a first data packet of a data flow to be transmitted across a network; extracting information from a header of the first data packet; building a key from the extracted information, the key having one or more possible key values; tracking information regarding the first network appliance and the one or more key values of the key; determining that the key is present in one or more data structures at the first network appliance, the one or more data structures comprising information regarding keys and associated application names, the one or more data structures further including information extracted from data packets of another data flow, the another dataflow commencing before the data flow; verifying that a prediction confidence level for an application name associated with the key that is present in the one or more data structures meets a confidence threshold; predicting an application name for the first data packet of the data flow; based on the prediction, building or updating the data structure to influence a learning algorithm for future inferences; and determining a network path for transmission of the data flow based on the predicted application name.
 9. The method of claim 8, wherein the key is present in the one or more data structures as a hash value.
 10. The method of claim 8, wherein the confidence threshold is variable.
 11. The method of claim 8, further comprising: receiving a subsequent data packet of the data flow; determining an application name from payload information of the subsequent data packet of the data flow; verifying that predicted application name based on the first data packet was correct; and updating confidence information in the data structure for the key associated with the extracted information from the header of the first data packet.
 12. The method of claim 8, further comprising: receiving a subsequent data packet of the data flow; determining an application name from payload information of the subsequent data packet of the data flow; determining that the predicted application name based on the first data packet was incorrect; and updating confidence information in the data structure for the key associated with the extracted information from the header of the first data packet.
 13. The method of claim 8, wherein the extracted information from the header of the first data packet comprises at least one of source IP address, destination IP address, source port, destination port, and protocol.
 14. The method of claim 8, wherein the key string built from the extracted information comprises a source IP address and a destination IP address.
 15. The method of claim 8, wherein the key string built from the extracted information comprises a minimum value of a source port and a destination port.
 16. The method of claim 8, further comprising transforming the extracted information from the header of the first data packet prior to building the key.
 17. The method of claim 1, wherein the confidence threshold is variable.
 18. The method of claim 1, wherein the extracted information from the header of the first data packet comprises at least one of source IP address, destination IP address, source port, destination port, and protocol.
 19. The method of claim 1, wherein the key generated from the extracted information comprises a source IP address and a destination IP address.
 20. The method of claim 1, wherein the key generated from the header of the first data packet comprises at least one of source IP address, destination IP address, source port, destination port, and protocol. 